Tail asymptotics of a Markov-modulated infinite-server queue
نویسندگان
چکیده
منابع مشابه
Tail asymptotics of a Markov-modulated infinite-server queue
This paper analyzes large deviation probabilities related to the number of customers in a Markov modulated infinite-server queue, with state-dependent arrival and service rates. Two specific scalings are studied: in the first, just the arrival rates are linearly scaled by N (for large N ), whereas in the second in addition the Markovian background process is sped up by a factor N , for some > 0...
متن کاملRefined large deviations asymptotics for Markov-modulated infinite-server systems
Many networking-related settings can be modeled by Markov-modulated infinite-server systems. In such models, the customers’ arrival rates and service rates are modulated by a Markovian background process; additionally, there are infinitely many servers (and consequently the resulting model is often used as a proxy for the corresponding many-server model). The Markov-modulated infinite-server mo...
متن کاملA Single-Server Queue with Markov Modulated Service Times
We study a queueing system with a Poisson arrival process and Markov modulated, exponential service requirements. For a modulating Markov Chain with two states, we show that the distribution of the number-in-system is a superposition of two matrix-geometric series and provide a simple algorithm for computing the rate and coefficient matrices. These results hold for both finite and infinite wait...
متن کاملA large-deviations analysis of Markov-modulated infinite-server queues
This paper studies an infinite-server queue in a Markov environment, that is, an infiniteserver queue with arrival rates and service times depending on the state of a Markovian background process. Scaling the arrival rates λi by a factor N , tail probabilities are examined when letting N tend to∞; non-standard large deviations results are obtained. An importance-sampling based estimation algori...
متن کاملA Central Limit Theorem for Markov-Modulated Infinite-Server Queues
This paper studies an infinite-server queue in a Markov environment, that is, an infinite-server queue with arrival rates and service times depending on the state of a Markovian background process. Scaling the arrival rates λi by a factor N and the rate qij of the background process by a factor N, with α ∈ R, we establish a central limit theorem as N tends to ∞. We find different scaling regime...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 2014
ISSN: 0257-0130,1572-9443
DOI: 10.1007/s11134-014-9412-z